Optimal implementations of UPGMA and other common clustering algorithms

In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n²)-time implementations of such algorithms which use a ‘locally closest’ joining scheme, and specify conditions under which this relaxed joining scheme is equivalent to the original one (i.e. ‘globally closest’).     

Concealed weapon detection and visualization in a synthesized image

Images acquired by heterogeneous image sensors may provide complementary information about the scene, for instance, the visual image can provide personal identification information like the facial pattern while the infrared (IR) or millimeter wave image can detect the suspicious regions of concealed weapons. Usually, a technique, namely multiresolution pixel-level image fusion is applied to integrate the information from multi-sensor images. However, when the images are significantly different, the performance of the multiresolution fusion algorithms is not always satisfactory. In this study, a new strategy consisting of two steps is proposed. The first step is to use an unsupervised fuzzy k-means clustering to detect the concealed weapon from the IR image. The detected region is embedded in the visual image in the second step and this process is implemented with a multiresolution mosaic technique. Therefore, the synthesized image retains the quality comparable to the visual image while the region of the concealed weapon is highlighted and enhanced. The experimental results indicate the efficiency of the proposed approach.This material is based on part of the work carried out at the SPCR laboratory of Lehigh University and the work is partially supported by the U. S. Army Research Office under grant number DAAD19-00-1-0431. The content of the information does not necessarily reflect the position or the policy of the federal government, and no official endorsement should be inferred.     

Robust pole clustering in a good ride quality region of aircraft for matrices with structured uncertainties

This paper presents a general analysis of robust pole clustering in a good ride quality region (GRQR) of aircraft for matrices with structured uncertainties. This region is an intersection of a ring and a horizontal strip, located in the left half-plane, which is a specific non-Ω-transformable region providing good ride quality of aircraft. The paper applies the Rayleigh principle along the norm theory to analyze robust pole clustering within this region since the generalized Lyapunov theory is not valid for non-Ω-transformable regions. Concerned uncertainties are structured/parametric uncertainties, including interval matrices. The results are useful for robust control analysis and design, especially, of robust good ride quality of aircraft, shuttles, vehicles and space station, as well as some industrial systems. An example of the F-16 dynamics for which GRQR is suitable is included to illustrate the results.     

一种新的时变大系统递阶控制求解方法

研究了一种新的大系统求解方法,利用Taylor级数的性质,将大系统时变递阶控制问题 转化为代数方程的求解问题.该方法简单,易于编成计算机程序.算例表明了它的有效性.     

几种常用CT图像分割算法分析和探讨

图像分割是数字图像处理的一个经典难题。其分割质量的好坏直接影响到图像处理的后续工作。因而在理论研究和实际应用中受到研究人员的广泛重视。本文在总结了过去的分割方法基础上,就目前常用几种分割方法进行实验研究。主要包括阈值分割、LOG算子分割、FCM聚类分割、分水岭分割,并结合CT图像进行图像分割。文章阐述了各种分割方法的概念及原理,并在此基础上对分割结果进行了分析和探讨,得出各种方法的优点和不足。这些实验结论将为后续研究提供科学依据。     

基于模糊聚类的半自动跟踪技术研究

现有半自动跟踪系统将操作员等效为准线性环节,增大了训练的难度和成本,不适应复杂战场环境下多个快速机动目标的选取和跟踪.利用特征提取方法得到视场的“潜在目标”集,引入模糊聚类方法,通过对操作响应进行分类,建立操控意图与目标运动特征之间的关系模型.通过充分的仿真试验,对比研究了跟踪平稳性、快速性、准确性等指标,结果说明该方法能够有效提升整体跟踪性能.     

一种新的轨迹聚类及有效性评价方法

为解决轨迹聚类问题,提出一种新的无监督轨迹聚类及聚类有效性评估方法。通过建立双层字符串轨迹模型,计算得到轨迹间距离并用作聚类依据。提出轨迹同距点比例的概念,以此作为聚类工具,并采用类内平均同距点比例作为聚类有效性评价值。利用麻省理工大学(Massachusetts Institute of Technology,MIT)停车场行人路径数据集进行实验,实验结果表明,新的无监督聚类算法能较好地完成轨迹聚类任务,平均类内同距点比例能够很好地衡量分类效果。     

一种基于数据竞争的高分辨率图像的聚类分割算法

近些年,机器人技术得到了迅猛的发展,应用越来越广泛.随着机器人技术的推广和普及,对机器人使用的要求也越来越高,其中对智能机器人的要求尤显迫切.机器视觉是智能机器人研究领域的一个重要研究方向.在机器人视觉系统中,核心问题是目标提取,对目标实时、准确、快速提取的关键技术是图像分割.由于机器人感知的环境的复杂性及目标的多样性,往往导致机器人感知获得的图像数据量较大且图像本身存在不可预知的复杂性,这就对准确的目标分割和提取处理提出了挑战性问题.本文针对高分辨率图像数据集的分割处理,提出一种新的聚类算法,即根据数据点能量和的大小识别类代表点和类成员点,通过数据点间的竞争识别出最有能力成为簇成员的数据点,并将其与mean shift聚类算法有效地结合应用于彩色图像分割问题中,能够快速高效地实现高分辨率图像的目标分割,并得到较好的图像分割效果.实验结果表明,本文算法在分割效果和分割效率上明显优于传统聚类算法.     

PERFORMANCE ANALYSIS OF TASK CLUSTERING HEURISTICS FOR SCHEDULING STATIC DAGS ON MULTIPROCESSOR SYSTEM*

CASS is a task management system that provides facilities for automatic grain-size optimization and task scheduling of parallel programs on distributed memory parallel architectures. The heart of CASS is a clustering module that partitions the tasks of a program into clusters that match the granularity of the target machine. This paper describes the clustering algorithms used by CASS and compares them with the best known algorithms reported in the literature, namely the PY algorithm (for clustering with task duplication) and the DSC algorithm (for clustering with no task duplication). It is shown that the clustering algorithms used by CASS outperform both the PY and DSC algorithms in terms of both speed and solution quality.     

基于IPv6组播的M-FHM IPv6切换技术

由于快速分层切换技术FHMIPv6将FMIPv6和HMIPv6切换技术结合起来,因此,在层次移动管理模型中部署快速切换时具有两种技术所具有的优点,可使切换延时进一步减少。文中通过对FHMIPv6的研究发现,其切换过程中DAD重复地址检测过程严重影响了切换性能,因此提出了基于IPv6组播的M-FHMIPv6切换技术。理论分析证明,M-FHMIPv6能有效减少DAD检测过程和各种信息交互的延迟。通过NS2实验仿真进一步说明:改进的M-FHMIPv6方案能减少切换延迟,平滑切换过程。